Description: 针对基于最小二乘法的ICP 曲面匹配算法难以处理待比较曲面的局部大变形问题, 提出一种改进算
法。即采用遗传算法确定曲面初始相对位置以保证匹配优化结果为全局最优值, 利用ICP 算法匹配结果构造
偏差阈值, 以此阈值过滤点群后再以最小二乘法进行匹配处理, 消除局部大变形影响, 获得合理的变换矩阵。以此变换矩阵变换初始点群再进行误差计算, 从而获得理想的匹配结果-Least square method based on the ICP surface matching algorithm to be relatively difficult to deal with the local surface deformation problem, an improved algorithm. Genetic algorithm that is used to determine the relative position of the initial surface in order to ensure optimization of the results of matching the global optimum value, the use of ICP algorithm to match the results of structural deviation threshold, this threshold point group and then filtered to match the least squares processing, the elimination of local large deformation effects of the transformation matrix to obtain reasonable. Transformation matrix to transform the initial point of the calculation error of another group in order to achieve an ideal match Platform: |
Size: 342016 |
Author:chenruibao |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package Platform: |
Size: 374784 |
Author:zouyan |
Hits:
Description: 字符串匹配问题。
输入一个字符串，程序计算出字符串里有没前后重复的部分，并输出重复的内容。-String matching problem. Enter a string, the program calculated before and after the string, there are no duplicate parts and duplicate the contents of the output. Platform: |
Size: 4096 |
Author:yanzi |
Hits:
Description: 字符串匹配问题：输入主串和子串，通过算法实现字符串的匹配：若字串在主串中出现在输出出现的位置，否则匹配失败-String matching problem: Enter the main series and sub-string, through the string matching algorithm: if the string appeared in the main string appear in the output, or the failure to match Platform: |
Size: 234496 |
Author:libingyang |
Hits:
Description: 对于数据结构队列的应用，主要是关于排队出对的配对问题。-Queue data structure for the application, mainly on the queue for the matching problem. Platform: |
Size: 66560 |
Author:wang |
Hits:
Description: ：本文把星表匹配问题转化成计算机视觉中的对应点匹配问题,接着使用二维Delaunay三角化方法对星表进行三角化,然后用RANSAC方法对星表的自动匹配问题进行了研究。研究结果表明,我们的方法能够快速有效地完成星表匹配。在总共960个样本中,除了两幅不符合匹配的星表之外,全部获得了正确的匹配结果。-: In this paper, the Star into a matching problem in computer vision matching the corresponding points, followed by the use of two-dimensional Delaunay triangulation method to the triangular form of stars, and then use RANSAC method of automatically catalog matching problem is studied. The results show that our method can be completed quickly and efficiently matching catalog. In a total of 960 samples, in addition to the two stars are not in line with the matching table, all access to the correct matching results. Platform: |
Size: 18432 |
Author:lilin |
Hits:
Description: 摘要：在交通场景下进行多目标跟踪时，如何正确检测出车辆间的相互遮挡是影响车辆跟踪结果的关键。针对问题，运用投
影理论分析交通场景的三维几何投影特征．用长方体投影轮廓模型对车辆进行建模，重构其乏维投影轮廓，以进行遮挡的检
测和分离。与以往的方法相比，它在估计出的车辆外形轮廓基础t-进行遮挡检测，不需要匹配操作，计算量较小，并能解决
基于匹配的方法无法对付的初始遮挡问题。用实验验证了该算法的有效性。-In multi—object tracking of traf氍c scene。how to detect the occlusion is a
key problem for vehicle
tracking．A novel vehicle contour based method is prope∞d to deal with this problem．This method firstly extracts the
3D geometry character from the vehicle images according to the projecting theory，establishes the model of the vehicle
with the euboid project contour，and then reconstructs its 3D project contour。detects and segments the occlusion l-e-
sious．Compared with traditional method，it deals with the problem with less computation because it generates the ve·
hide contour firstly and no match calculation is needed．Moreover，this method is able to solve the initial occlusion
problem，which could not be solved with matching based method．The experimental results show that the proposed
method iS more emcient． Platform: |
Size: 296960 |
Author:christine |
Hits:
Description: 跟踪滤波的目的是根据已获得的目标观测数据对目标的状态进行精确估计，跟踪滤波的关键是对机动目标的跟踪能力，机动目标跟踪的主要困难在于跟踪设定的目标模型与实际的目标动力学模型的匹配问题。
-The purpose of tracking filter is based on objective observational data has been the target of the state accurately estimate the key to tracking filter for maneuvering target tracking capabilities, the main difficulty maneuvering target tracking is to track the target model to set realistic goals and motivation learn the model matching problem. Platform: |
Size: 4096 |
Author:coffee |
Hits:
Description: WM算法的c++源代码，可以实现多模式匹配问题。附带有AC算法源代码。-WM algorithm c++ source code, can achieve multi-pattern matching problem. Comes with AC algorithm source code. Platform: |
Size: 4096 |
Author:汪浩 |
Hits:
Description: BM算法源代码，是用c++写的。适用于字符串的多模式匹配问题。-BM algorithm source code is written in c++. For a string of multi-pattern matching problem. Platform: |
Size: 188416 |
Author:汪浩 |
Hits:
Description: The solution of the Chinese postman problem using matching theory is given. The convex
hull of integer solutions is described as a linear programming polyhedron. This polyhedron is
used to show that a good algorithm gives an optimum solution. The algorithm is a specialization
of the more general b-matching bl Platform: |
Size: 3000320 |
Author:shuisheng |
Hits:
Description: 利用栈的知识判断一串字符中的括号是否匹配问题。-Knowledge of the use of the stack to determine whether the string of characters in parentheses matching problem. Platform: |
Size: 1024 |
Author:杨芬 |
Hits:
Description: 主要是串匹配问题，用三种代码实现。并对其进行比较-String matching problem is mainly used three kinds of code to achieve. And to compare them Platform: |
Size: 8192 |
Author:lina |
Hits:
Description: 在学算法课时，做实验自己编写的一个关于运动员配对问题的代码-Algorithm class in school, do an experiment to write your own code on the player matching problem Platform: |
Size: 272384 |
Author:杨志灵 |
Hits:
Description: 一些经典算法包括：有向树k中值问题，正则表达式匹配问题，最大长方体问题，直线K中值问题--KML-Some classic algorithms include: the k value to the tree problem, regular expression matching problem, the biggest problem rectangular, linear K value problems- KML Platform: |
Size: 1137664 |
Author:榴莲飘飘 |
Hits:
Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，是语音识别中出现较早、较为经典的一种算法。-DTW (Dynamic Time Warping, Dynamic Time Warping) algorithm based on dynamic programming (DP) ideas, to solve the pronunciation of different lengths of the template matching problem, is the speech recognition appeared in the early, more of a classical algorithm. Platform: |
Size: 6144 |
Author:伏伊宁 |
Hits:
Search - matching problem